#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
const int mod=1e9+7;
long long dp[maxn]={0};
int fb(int n)
{
	if(n<2) return 1;
	else if(dp[n]!=0) return dp[n]%mod;
	else {
		dp[n]=fb(n-1)%mod+fb(n-2)%mod;
		return dp[n]%mod;	
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	printf("%d",fb(n)); 
	return 0;
}
